HP-SL Abstract Type Syntax (Records and Unions)
نویسنده
چکیده
The report outlines the derived syntax provided within the HP-SL specification language to enable the definition ofrecord and union types. It describes the notation at two levels. First it describes the requirements for such a not.ation by way of an example the informally defines the derived short-hand notation. Secondly it provides a det.ailed definition by way of axiom schemas of the translation between the derived notation and the base HP-SL notation.
منابع مشابه
Features in Abstract and Concrete Syntax
The division of grammars into abstract and concrete syntax is universally used in compilers. In linguistics, Curry’s distinction between tectogrammar and phenogrammar is a similar idea. This architecture has become popular in recent years, exemplified by formalisms such as GF, ACG, and HOG. These formalisms give a perspective on language that is very different from the perspective in feature-ba...
متن کاملAn Overview of HP-SL
The Software Engineering Department of HP Labs is developing and applying a small but powerful specification language, HP-SL. This report provides an overview of the language, its supporting tools and the way in which it is being applied.
متن کاملImproved Inclusion-exclusion Inequalities for Simplex and Orthant Arrangements
Improved inclusion-exclusion inequalities for unions of sets are available wherein terms usually included in the alternating sum formula can be left out. This is the case when a key abstract tube condition, can be shown to hold. Since the abstract tube concept was introduced and refined by the authors, several examples have been identified, and key properties of abstract tubes have been describ...
متن کاملITU-T Rec. Z.100 Annex F1 (11/2000) Specification and description language (SDL) Annex F1: Formal Definition of SDL: General
syntax rules Abstract syntax rules from the language definition are directly translated to the ASM notation, using certain conventions that will be explained by examples. Basically, an abstract syntax rule can be understood as declaring one or more (tuple) domains, and defining functions to construct and select values of the component domains. However, syntax nodes have an identity as opposed t...
متن کاملAlmost disjunctive list-decoding codes
Abstract. A binary code is said to be a disjunctive list-decoding sL-code, s ≥ 1, L ≥ 1, (briefly, LD sL-code) if the code is identified by the incidence matrix of a family of finite sets in which the union of any s sets can cover not more than L− 1 other sets of the family. In this paper, we introduce a natural probabilistic generalization of LD sL-code when the code is said to be an almost di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991